Large convex holes in random point sets
نویسندگان
چکیده
A convex hole (or empty convex polygon) of a point set P in the plane is a convex polygon with vertices in P , containing no points of P in its interior. Let R be a bounded convex region in the plane. We show that the expected number of vertices of the largest convex hole of a set of n random points chosen independently and uniformly over R is Θ(logn/(log log n)), regardless of the shape of R.
منابع مشابه
On balanced 4-holes in bichromatic point sets
Let S = R∪B be a set of n points in general position in the plane. The elements of R and B will be called, respectively, the red and blue elements of S. A k-hole of S is a simple polygon with k vertices, all in S, and containing no element of S in its interior. A 4-hole of S is balanced if it has two blue and two red vertices. In this paper, we characterize the set of bicolored points S = R∪B t...
متن کاملOn k-Gons and k-Holes in Point Sets
We consider a variation of the classical Erdős-Szekeres problems on the existence and number of convex k-gons and k-holes (empty k-gons) in a set of n points in the plane. Allowing the k-gons to be non-convex, we show bounds and structural results on maximizing and minimizing their numbers. Most noteworthy, for any k and sufficiently large n, we give a quadratic lower bound for the number of k-...
متن کاملSweep Line Algorithm for Convex Hull Revisited
Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points and so on. Computing the convex hull of a set of point is one of the most fundamental and imp...
متن کاملHoles in 2 - convex point sets ∗
Let S be a finite set of n points in the plane in general position. A k-hole of S is a simple polygon with k vertices from S and no points of S in its interior. A simple polygon P is l-convex if no straight line intersects the interior of P in more than l connected components. Moreover, a point set S is l-convex if there exists an l-convex polygonalization of S. Considering a typical Erdős-Szek...
متن کاملOn an empty triangle with the maximum area in planar point sets
We deal with only finite point sets P in the plane in general position. A point set is convex or in convex position if it determines a convex polygon. A convex subset Q of P is said to be empty if no point of P lies inside the convex hull of Q. An empty convex subset of P with k elements is also called a k-hole of P . Let P be an n planar point set in general position. For a subset Q of P , den...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Comput. Geom.
دوره 46 شماره
صفحات -
تاریخ انتشار 2013